Tim Roughgarden

Results: 191



#Item
41

Network Design with Weighted Players Ho-Lin Chen∗ Tim Roughgarden† June 21, 2007

Add to Reading List

Source URL: theory.stanford.edu

- Date: 2007-06-22 02:43:41
    42

    CS364B: Frontiers in Mechanism Design Lecture #20: Characterization of Revenue-Maximizing Auctions∗ Tim Roughgarden† March 12, 2014

    Add to Reading List

    Source URL: theory.stanford.edu

    - Date: 2015-01-30 15:19:36
      43

      CS261: A Second Course in Algorithms Lecture #17: Linear Programming and Approximation Algorithms∗ Tim Roughgarden† March 1, 2016

      Add to Reading List

      Source URL: theory.stanford.edu

      - Date: 2016-03-14 10:22:37
        44

        CS364B: Frontiers in Mechanism Design Lecture #17: Part I: Demand Reduction in Multi-Unit Auctions Revisited ∗ Tim Roughgarden† March 5, 2014

        Add to Reading List

        Source URL: theory.stanford.edu

        - Date: 2014-05-13 09:28:58
          45

          Uncoupled Potentials for Proportional Allocation Markets Uri Nadav, Ramesh Johari, and Tim Roughgarden Abstract— We study resource allocation games where allocations to agents are made in proportion to their bids. We s

          Add to Reading List

          Source URL: theory.stanford.edu

          - Date: 2011-09-28 00:43:42
            46

            CS261: A Second Course in Algorithms Lecture #1: Course Goals and Introduction to Maximum Flow∗ Tim Roughgarden† January 5, 2016

            Add to Reading List

            Source URL: theory.stanford.edu

            - Date: 2016-03-25 14:09:39
              47

              Lightweight Coloring and Desynchronization for Networks Arik Motskin, Tim Roughgarden, Primoz Skraba and Leonidas Guibas Stanford University, Stanford, CAEmail: {amotskin, primoz}@stanford.edu, {tim, guibas}@cs.st

              Add to Reading List

              Source URL: theory.stanford.edu

              - Date: 2009-06-03 14:54:09
                48

                Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation) Tim Roughgarden∗ Sergei Vassilvitskii†

                Add to Reading List

                Source URL: web.stanford.edu

                - Date: 2016-08-08 16:09:45
                  49

                  CS364A: Algorithmic Game Theory Lecture #16: Best-Response Dynamics∗ Tim Roughgarden† November 13,

                  Add to Reading List

                  Source URL: theory.stanford.edu

                  - Date: 2015-12-03 15:11:11
                    50

                    Simultaneous Single-Item Auctions Kshipra Bhawalkar? and Tim Roughgarden?? Stanford University, Stanford, CA, USA, {kshipra,tim}@cs.stanford.edu Abstract. In a combinatorial auction (CA) with item bidding, several goods

                    Add to Reading List

                    Source URL: theory.stanford.edu

                    - Date: 2012-10-02 12:28:37
                      UPDATE